A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes
نویسندگان
چکیده
We study the problem of how to obtain an integer realization of a 3d polytope when an integer realization of its dual polytope is given. We focus on grid embeddings with small coordinates and develop novel techniques based on Colin de Verdière matrices and the Maxwell–Cremona lifting method. We show that every truncated 3d polytope with n vertices can be realized on a grid of size O(n). Moreover, for every simplicial 3d polytope with maximal vertex degree ∆ and vertices placed on an L × L× L grid, a dual polytope can be realized on an integer grid of size L. This implies that for a class C of simplicial 3d polytopes with bounded vertex degree and polynomial size grid embedding, the dual polytopes of C can be realized on a polynomial size grid as well.
منابع مشابه
Regular Polytopes in Z
In [3], all embeddings of regular polyhedra in the three dimensional integer lattice were characterized. Here, we prove some results toward solving this problem for all higher dimensions. Similarly to [3], we consider a few special polytopes in dimension 4 that do not have analogues in higher dimensions. We then begin a classification of hypercubes, and consequently regular cross polytopes in t...
متن کاملExtraction and 3D Segmentation of Tumors-Based Unsupervised Clustering Techniques in Medical Images
Introduction The diagnosis and separation of cancerous tumors in medical images require accuracy, experience, and time, and it has always posed itself as a major challenge to the radiologists and physicians. Materials and Methods We Received 290 medical images composed of 120 mammographic images, LJPEG format, scanned in gray-scale with 50 microns size, 110 MRI images including of T1-Wighted, T...
متن کاملEmbedding Stacked Polytopes on a Polynomial-Size Grid Citation
We show how to realize a stacked 3D polytope (formed by repeatedly stacking a tetrahedron onto a triangular face) by a strictly convex embedding with its n vertices on an integer grid of size O(n)× O(n)× O(n). We use a perturbation technique to construct an integral 2D embedding that lifts to a small 3D polytope, all in linear time. This result solves a question posed by Günter M. Ziegler, and ...
متن کاملPermeability upscaling in fractured reservoirs using different optimized mother wavelets at each level
We use a multi-resolution analysis based on a wavelet transform to upscale a 3D fractured reservoir. This paper describes a 3D, single-phase, and black-oil geological model (GM) that is used to simulate naturally-fractured reservoirs. The absolute permeability and porosity of GM is upscaled by all the possible combinations of Haar, Bior1.3, and Db4 wavelets in three levels of coarsening. The ap...
متن کاملGrid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines
We investigate the combinatorial structure of linear programs on simple d-polytopes with d + 2 facets. These can be encoded by admissible grid orientations. Admissible grid orientations are also obtained through orientation properties of a planar point configuration or by the dual line arrangement. The point configuration and the polytope corresponding to the same grid are related through an ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 56 شماره
صفحات -
تاریخ انتشار 2013